Common Randomness in Information Theory and Cryptography - Part II: CR Capacity
نویسندگان
چکیده
The CR capacity of a two-teminal model is deened as the maximum rate of common randomness that the terminals can generate using resources speciied by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identiication capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback.
منابع مشابه
Common randomness and secret key generation with a helper
We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit ...
متن کاملWireless Information-Theoretic Security - Part II: Practical Implementation
In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect channel state information. In Part II, we develop a practical secret key agreement protocol for Gaussian and quasi-static fading wiretap channels. The protoco...
متن کاملMultiterminal Secrecy by Public Discussion
This monograph describes principles of information theoretic secrecy generation by legitimate parties with public discussion in the presence of an eavesdropper. The parties are guaranteed secrecy in the form of independence from the eavesdropper’s observation of the communication. Part I develops basic technical tools for secrecy generation, many of which are potentially of independent interest...
متن کاملFrequency hopping does not increase anti-jamming resilience of wireless channels
The effectiveness of frequency hopping for antijamming protection of wireless channels is analyzed from an information-theoretic perspective. The sender can input its symbols into one of several frequency subbands at a time. Each subband channel is modeled as an additive noise channel. No common randomness between sender and receiver is assumed. It is shown that capacity is positive, and then e...
متن کاملA Decentralized Online Sortition Protocol
We propose a new online sortition protocol which is decentralized. We argue that our protocol has safety, fairness, randomness, non-reputation and openness properties. Sortition is a process that makes random decision and it is used in competitions and lotteries to determine who is the winner. In the real world, sortition is simply done using a lottery machine and all the participa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998